Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
نویسندگان
چکیده
منابع مشابه
On Hamiltonian cycles and Hamiltonian paths
A Hamiltonian cycle is a spanning cycle in a graph, i.e., a cycle through every vertex, and a Hamiltonian path is a spanning path. In this paper we present two theorems stating sufficient conditions for a graph to possess Hamiltonian cycles and Hamiltonian paths. The significance of the theorems is discussed, and it is shown that the famous Ore’s theorem directly follows from our result. 2004...
متن کاملOn Hamiltonian alternating cycles and paths
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this paper, we relax the constraint on the cycles and paths from being plane to being 1-plane, and deal with the same type of questions as those for the plane case...
متن کاملHamiltonian Paths and Cycles in Planar Graphs
We examine the problem of counting the number of Hamiltonian paths and Hamiltonian cycles in outerplanar graphs and planar graphs, respectively. We give an O(nαn) upper bound and an Ω(αn) lower bound on the maximum number of Hamiltonian paths in an outerplanar graph with n vertices, where α ≈ 1.46557 is the unique real root of α = α + 1. For any positive integer n ≥ 6, we define an outerplanar ...
متن کاملHamiltonian paths and cycles in hypertournaments
Given two integers n and k, n ≥ k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V is a set of vertices, |V | = n and A is a set of k-tuples of vertices, called arcs, so that for any k-subset S of V , A contains exactly one of the k! k-tuples whose entries belong to S. A 2-hypertournament is merely an (ordinary) tournament. A path is a sequence v1a1v2a2v3...vt−1at−1vt of disti...
متن کاملHamiltonian cycles through a linear forest
Let G be a graph of order n. A graph is linear forest if every component is a path. Let S be a set of m edges of G that induces a linear forest. An edge xy ∈ E(G) is called an S-edge if xy ∈ S. An S-edge-length of a cycle in G is defined as the number of S-edges that it contains. We prove that if the degree sum in G of every pair of nonadjacent vertices of G is at least n + m, then G contains h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.09.031